The Zeta Function of a Hypergraph
نویسنده
چکیده
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto’s factorization results for biregular bipartite graphs apply, leading to exact factorizations. For (d, r)-regular hypergraphs, we show that a modified Riemann hypothesis is true if and only if the hypergraph is Ramanujan in the sense of Winnie Li and Patrick Solé. Finally, we give an example to show how the generalized zeta function can be applied to graphs to distinguish non-isomorphic graphs with the same Ihara-Selberg zeta function.
منابع مشابه
A New Determinant Expression of the Zeta Function for a Hypergraph
Recently, Storm [10] defined the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it by the Perron-Frobenius operator of a digraph and a deformation of the usual Laplacian of a graph. We present a new determinant expression for the Ihara-Selberg zeta function of a hypergraph, and give a linear algebraic proof of Storm’s Theorem. Furthermore, we generalize the...
متن کاملBartholdi Zeta Functions for Hypergraphs
Recently, Storm [8] defined the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it. We define the Bartholdi zeta function of a hypergraph, and present a determinant expression of it. Furthermore, we give a determinant expression for the Bartholdi zeta function of semiregular bipartite graph. As a corollary, we obtain a decomposition formula for the Bartholdi...
متن کاملA more accurate half-discrete Hardy-Hilbert-type inequality with the best possible constant factor related to the extended Riemann-Zeta function
By the method of weight coefficients, techniques of real analysis and Hermite-Hadamard's inequality, a half-discrete Hardy-Hilbert-type inequality related to the kernel of the hyperbolic cosecant function with the best possible constant factor expressed in terms of the extended Riemann-zeta function is proved. The more accurate equivalent forms, the operator expressions with the norm, the rever...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملDevelopments in structural learning using Ihara coefficients and hypergraph representations
This thesis addresses the problems in structural learning, particularly focusing on structural characterization and matching. To this end, we present an approach named Ihara coefficients, which is capable of characterizing structures of varying order into pattern space related to prime cycles. Furthermore, we develop a matching algorithm for establishing correspondences between structures by co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006